A C.E. Real That Cannot Be SW-Computed by Any Ω Number
نویسندگان
چکیده
The strong weak truth table (sw) reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occurs naturally in proofs in classical computability theory as well as in the recent work of Soare, Nabutovsky and Weinberger on applications of computability to differential geometry. We study the sw-degrees of c.e. reals and construct a c.e. real which has no random c.e. real (i.e. Ω number) sw-above it.
منابع مشابه
Chaitin Ω Numbers , Solovay Machines , and Incompleteness
Computably enumerable (c.e.) reals can be coded by Chaitin machines through their halting probabilities. Tuning Solovay’s construction of a Chaitin universal machine for which ZFC (if arithmetically sound) cannot determine any single bit of the binary expansion of its halting probability, we show that every c.e. random real is the halting probability of a universal Chaitin machine for which ZFC...
متن کاملEquivalence structures and isomorphisms in the difference hierarchy
We examine the notion of structures and functions in the Ershov difference hierarchy, and of equivalence structures in particular. A equivalence structure A = (A,E) has universe A = ω and an equivalence relation E. The equivalence class [a] of a ∈ A is {b ∈ A : aEb} and the character K of A is {〈k, n〉 ∈ (ω − {0}) : A has at least n classes of size k}. It is known that for any character K, there...
متن کاملDegrees of d. c. e. reals
A real is called c.e. if it is the halting probability of a prefix free Turing machine. Equivalently, a real is c.e. if it is left computable in the sense that L(α) = {q ∈ Q : q ≤ α} is a computably enumerable set. The natural field formed by the c.e. reals turns out to be the field formed by the collection of reals of the form α− β where α and β are c.e. reals. While c.e. reals can only be fou...
متن کاملWorking with Strong Reducibilities above Totally Ω-c.e. and Array Computable Degrees
We investigate the connections between the complexity of a c.e. set, as calibrated by its strength as an oracle for Turing computations of functions in the Ershov hierarchy, and how strong reducibilities allow us to compute such sets. For example, we prove that a c.e. degree is totally ω-c.e. iff every set in it is weak truth-table reducible to a hypersimple, or ranked, set. We also show that a...
متن کاملContinuity of capping in CbT
A set A ⊆ ω is called computably enumerable (c.e., for short), if there is an algorithm to enumerate the elements of it. For sets A,B ⊆ ω, we say that A is bounded Turing reducible to B if there is a Turing functional, Φ say, with a computable bound of oracle query bits such that A is computed by Φ equipped with an oracle B, written A ≤bT B. Let EbT be the structure of the c.e. bT-degrees, the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 47 شماره
صفحات -
تاریخ انتشار 2006